Sparse Sampling in Helical Cone-Beam CT Perfect Reconstruction Algorithms
نویسندگان
چکیده
In the current paper we consider the Helical Cone Beam CT. This scanning method exposes the patient to large quantities of radiation and results in very large amounts of data being collected and stored. Both these facts are prime motivators for the development of an efficient, reduced rate, sampling pattern. We calculate bounds on the support in the frequency domain of the collected data and use these to suggest an efficient sampling pattern. A reduction of up to a factor of 2 in sampling rate is suggested. Indeed, we show that reconstruction quality is not affected by this reduction of sampling rates.
منابع مشابه
PI-line-based image reconstruction in helical cone-beam computed tomography with a variable pitch.
Current applications of helical cone-beam computed tomography (CT) involve primarily a constant pitch where the translating speed of the table and the rotation speed of the source-detector remain constant. However, situations do exist where it may be more desirable to use a helical scan with a variable translating speed of the table, leading a variable pitch. One of such applications could aris...
متن کاملReview of Recent Developments in Cone-beam Ct Reconstruction Algorithms for Long-object Problem
Long-object problem and short-object problem both deal with reconstruction problems with truncated conebeam CT projections acquired with a helical path. They have significantly less practical limitations than original exact cone-beam CT reconstruction algorithms which the cone-beam must cover the whole object. The short-object problem can be defined as reconstruction of the whole object having ...
متن کاملSimple Quasi-Exact Filtered Backprojection Algorithms for Long-Object Problem in Helical Cone-Beam Tomography
Since the development of multi-slice helical CT, cone-beam reconstruction with a helical vertex path is receiving increasing attention. The current multi-slice CT scanners are adopting a class of approximate reconstruction algorithms which can be viewed an extension of the 2-D FBP algorithm. However, these approximate algorithms break down as the pitch of helix becomes large. In fact, major com...
متن کاملExact helical reconstruction using native cone-beam geometries.
This paper is about helical cone-beam reconstruction using the exact filtered backprojection formula recently suggested by Katsevich (2002a Phys. Med. Biol. 47 2583-97). We investigate how to efficiently and accurately implement Katsevich's formula for direct reconstruction from helical cone-beam data measured in two native geometries. The first geometry is the curved detector geometry of third...
متن کاملExact and approximate algorithms for helical cone-beam CT.
This paper concerns image reconstruction for helical x-ray transmission tomography (CT) with multi-row detectors. We introduce two approximate cone-beam (CB) filtered-backprojection (FBP) algorithms of the Feldkamp type, obtained by extending to three dimensions (3D) two recently proposed exact FBP algorithms for 2D fan-beam reconstruction. The new algorithms are similar to the standard Feldkam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of X-ray science and technology
دوره 24 3 شماره
صفحات -
تاریخ انتشار 2016